Bisectors and Pinned Distances

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euclidean Skeletons and Conditional Bisectors

This paper deals with the determination of skeletons and conditional bisectors in discrete binary images using the Euclidean metrics. The algorithm, derived from [18], proceeds in two steps: rst, the Centers of the Euclidean Maximal Discs (CMD) included in the set to skeletonize are characterized and robustly identi ed. Second, a refront propagation is simulated starting from the set boundaries...

متن کامل

On bisectors in normed planes

In this note, we completely describe the shape of the bisector of two given points in a two-dimensional normed vector space. More precisely, we show that, depending on the position of two given points with respect to the shape of the unit circle, the following holds: the bisector of a non-strict pair of points consists of two cones and a curve, which has properties similar to those of bisectors...

متن کامل

Bisectors in Minkowski 3-Space

We discuss the concept of the bisector of a segment in a Minkowski normed n-space. We prove that all bisectors are topological images of a plane of the embedding Euclidean 3-space iff the shadow boundaries of the unit ball K are topological circles. To a conjectured proving strategy for dimensions n, we introduce the concept of general parameter sphere of the unit ballK, corresponding to a dire...

متن کامل

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains

We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of triangles in the terrain, we show the following two results. (i) If the triangles of the terrain have bounded slope and the projection of the set of triangles onto the xy-plane has low density, then the worst-case compl...

متن کامل

On the Area Bisectors of a Polygon

We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di erent partitionings of the vertices of P . We derive an algebraic characterization of area bisectors. We then show that there are simple polygons with n vertices that have (n) combinatorially distinct are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2019

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-019-00122-w